Gröbner basis solutions of constrained interpolation problems
نویسندگان
چکیده
منابع مشابه
Gröbner Basis Approach to Some Combinatorial Problems
We consider several simple combinatorial problems and discuss different ways to express them using polynomial equations and try to describe the Gröbner basis of the corresponding ideals. The main instruments are complete symmetric polynomials that help to express different conditions in rather compact way.
متن کاملGröbner Basis Methods for Minimal Problems in Computer Vision
Preface Working with problems concerning relative pose for autonomous vehicles has given me the inspiration and motive to consider the task of solving multivariate polynomial equations. In this thesis a strategy for solving multivariate polynomial equations using the elegant framework of algebraic geometry and the powerful tools from numerical linear algebra is presented. This strategy has perm...
متن کاملConstrained Interpolation via Cubic Hermite Splines
Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation. It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...
متن کاملGröbner Basis Based Cryptanalysis of SHA-1
Recently, Wang proposed a new method to cryptanalyze SHA-1 and found collisions of 58-round SHA-1. However many details of Wang’s attack are still unpublished, especially, 1) How to find differential paths? 2) How to modify messages properly? For the first issue, some results have already been reported. In our article, we clarify the second issue and give a sophisticated method based on Gröbner...
متن کاملComplexity of Gröbner basis detection and border basis detection
Gröbner basis detection (GBD) is defined as follows: given a set of polynomials, decide whether there exists and if “yes” find a term order such that the set of polynomials is a Gröbner basis. This problem was proposed by Gritzmann and Sturmfels (1993) and it was shown to be NP-hard by Sturmfels and Wiegelmann. We investigate the computational complexity of this problem when the given set of po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2002
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(01)00509-2